Simple 8-Designs with Small Parameters
نویسندگان
چکیده
We describe a computer search for simple designs with prescribed automor-phism groups yielding designs with parameter sets 7-In several of these cases we are able to determine the exact number of isomorphism types of designs with that prescribed automorphism group. c
منابع مشابه
The Discovery of Simple 7-Designs with Automorphism Group PTL (2, 32)
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endowed with graphical interface modules. Standard applications can be run automatically whereas research projects mostly require small C or C++ programs. The basic philosophy behind the system is to transform problems int...
متن کاملRecognition of features of the entrance of Pahlavi period buildings in Zahedan City
In this article, the aim is to Recognition the features of the entrances of Pahlavi period buildings in Zahedan and then prioritize these features. The research method is descriptive-analytical and quantitative-qualitative. Data collection in the first stage is through content analysis method based on images and researcher observations of 8 buildings in the city. In the second stage, building f...
متن کاملNew infinite families of 3-designs from preparata codes over Z4
We consider t-designs constructed from codewords in the Preparata code ~ ove r 2~4. A new approach is given to prove that the support (size 5) of minimum Lee weight codewords form a simple 3-design for any odd integer m >t 3. We also show that the support of codewords with support size 6 form four new families of simple 3-designs, with parameters (2",6,2" 8 ) , (2",6,5 (2 m-I 4)), (2m,6,20 • (2...
متن کاملA computer approach to the enumeration of block designs which are invariant with respect to a prescribed permutation group
We present a new approach to the construction of simple block designs. Using the computer package DISCRETA, we start with the construction of block designs which are invariant with respect to some prescribed group of automorphisms. Therefore, one applies the method of Kramer and Mesner which means that one has to solve systems of diophantine equations to get the designs. DISCRETA has proven its...
متن کاملOn The Spectrum of Minimal Defining Sets of Full Designs
A defining set of a t-(v,k,λ ) design is a subcollection of the block set of the design which is not contained in any other design with the same parameters. A defining set is said to be minimal if none of its proper subcollections is a defining set. A defining set is said to be smallest if no other defining set has a smaller cardinality. A t-(v,k,λ ) design D = (V,B) is called a full design if ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 15 شماره
صفحات -
تاریخ انتشار 1998